A Genesis of Interval Orders and Semiorders: Transitive NaP-preferences

نویسنده

  • Alfio Giarlotta
چکیده

A NaP-preference (necessary and possible preference) on a set A is a pair ( , P ) of binary relations on A such that its necessary component N is a partial preorder, its possible component P is a completion of , and the two components jointly satisfy natural forms of mixed completeness and mixed transitivity. We study additional mixed transitivity properties of a NaP-preference ( , P ) , which culminate in the full transitivity of its possible component . Interval orders and semiorders are strictly related to these properties, since they are the possible components of suitably transitive NaP-preferences. Further, we introduce strong versions of interval orders and semiorders, which are characterized by enhanced forms of mixed transitivity, and use a geometric approach to compare them to other well known preference relations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical representability of semiorders

In the framework of the analysis of orderings whose associated indifference relation is not necessarily transitive, we study the structure of a semiorder, and its representability through a real-valued function and a threshold. Inspired in a recent characterization of the representability of interval orders, we obtain a full characterization of the existence of numerical representations for sem...

متن کامل

Inductive Characterizations of Finite Interval Orders and Semiorders

We introduce an inductive definition for two classes of orders. By simple proofs, we show that one corresponds to the interval orders class and that the other is exactly the semiorders class. To conclude we consider most of the known equivalence theorems on interval orders and on semiorders, and we give simple and direct inductive proofs of these equivalences with ours characterizations.

متن کامل

Generalizations of Semiorders: A Review Note

Semiorders may form the simplest class of partially ordered sets that accommodate thresholds of discriminability in binary comparisons. Many other classes of ordered sets that generalize the uniform-threshold feature of semiorders have been studied in recent years. This note describes a variety of generalizations and their interrelationships, including equivalences and proper inclusions between...

متن کامل

Semiorders and Riordan Numbers

In this paper, we define a class of semiorders (or unit interval orders) that arose in the context of polyhedral combinatorics. In the first section of the paper, we will present a pure counting argument equating the number of these interesting (connected and irredundant) semiorders on n + 1 elements with the nth Riordan number. In the second section, we will make explicit the relationship betw...

متن کامل

Ordered sets with interval representation and ( m , n )-Ferrers relation

Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifference relation. Their generalization has given birth to many other classes of ordered sets, each of them characterized by an interval representation, by the properties of its relations or by forbidden configurations. In this paper, we are interested in preference structures having an interval represe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Order

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2014